Polytopes and arrangements: Diameter and curvature
نویسندگان
چکیده
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities deflning the polytope. By analogy with a result of Dedieu, Malajovich and Shub, we conjecture that the average diameter of a bounded cell of an arrangement is less than the dimension. We prove continuous analogues of two results of Holt-Klee and Klee-Walkup: we construct a family of polytopes which attain the conjectured order of the largest total curvature, and we prove that the special case where the number of inequalities is twice the dimension is equivalent to the general case. We substantiate these conjectures in low dimensions and highlight additional links. 1 Continuous Analogue of the Conjecture of Hirsch Let P be a full dimensional convex polyhedron deflned by m inequalities in dimension n. The diameter –(P ) is the smallest number such that any two vertices of the polyhedron P can be connected by a path with at most –(P ) edges. The conjecture of Hirsch, formulated in 1957 and reported in [2], states that the diameter of a polyhedron deflned by m inequalities in dimension n is not greater than m¡n. The conjecture does not hold for unbounded polyhedra. A polytope is a bounded polyhedron. No polynomial bound is known for the diameter of a polytope. Conjecture 1.1. (Conjecture of Hirsch for polytopes) The diameter of a polytope deflned by m inequalities in dimension n is not greater than m ¡ n. Intuitively, the total curvature [15] is a measure of how far ofi a certain curve is from being a straight line. Let ˆ : [fi; fl] ! R be a C((fi ¡ "; fl + ")) map for some " > 0 with a non-zero derivative in [fi; fl]. Denote its arc length by l(t) = R t fi k _̂ (¿)kd¿ , its parametrization by the arc length by ˆarc = ˆ – l¡1 : [0; l(fl)] ! R, and its curvature at the point t by •(t) = ̃̂arc(t). The total curvature is deflned as R l(fl) 0 k•(t)kdt. The requirement _̂ 6= 0 insures that any given segment of the curve is traversed only once and allows to deflne a curvature at any point on the curve. We present one useful proposition. Roughly speaking, it states that two similar curves might not difier greatly in their total curvatures either. This fact is used in Section 3 in proving the analogue of the d-step conjecture for the total curvature of the central path. Proposition 1.1. Let ˆ be as above and f`gj=0;1;::: be a sequence of C((fi ¡ "; fl + ")) functions with non-zero derivatives in [fi; fl] that converge to ˆ point-wise as j ! 1, i.e., `(t) ! ˆ(t) for all t 2 [fi; fl]. Then the total curvature of ˆ is bounded from above by the inflmum limit of the total curvature of ` over all j.
منابع مشابه
The continuous d-step conjecture for polytopes
The curvature of a polytope, deflned as the largest possible total curvature of the associated central path, can be regarded as the continuous analogue of its diameter. We prove the analogue of the result of Klee and Walkup. Namely, we show that if the order of the curvature is less than the dimension d for all polytope deflned by 2d inequalities and for all d, then the order of the curvature i...
متن کاملA Continuous d -Step Conjecture for Polytopes
The curvature of a polytope, defined as the largest possible total curvature of the associated central path, can be regarded as a continuous analogue of its diameter. We prove an analogue of the result of Klee and Walkup. Namely, we show that if the order of the curvature is less than the dimension d for all polytopes defined by 2d inequalities and for all d , then the order of the curvature is...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملOrientations, Lattice Polytopes, and Group Arrangements II: Modular and Integral Flow Polynomials of Graphs
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory of Ehrhart polynomials to obtain properties of modular and integral flow polynomials. The emphasis is on the geometrical treatment through subgroup arrangeme...
متن کاملDiameter and Curvature: Intriguing Analogies
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the results of Holt and Klee, and Klee and Walkup: We construct a family of polytopes which attain the conjectured order of the largest curvature, and prove that the special case where the number of inequalities is twice t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008